Secure Coprocessor-based Private Information Retrieval without Periodical Preprocessing
نویسندگان
چکیده
Early works on Private Information Retrieval (PIR) focused on minimizing the necessary communication overhead. They seemed to achieve this goal but at the expense of query response time. To mitigate this weakness, protocols with secure coprocessors were introduced. They achieve optimal communication complexity and better online processing complexity. Unfortunately, all secure coprocessor-based PIR protocols require heavy periodical preprocessing. In this paper, we propose a new protocol, which is free from the periodical preprocessing while offering the optimal communication complexity and almost optimal online processing complexity. The proposed protocol is proven to be secure.
منابع مشابه
Almost Optimal Private Information Retrieval
A private information retrieval (PIR) protocol allows a user to retrieve one of N records from a database while hiding the identity of the record from the database server. With the initially proposed PIR protocols to process a query, the server has to process the entire database, resulting in an unacceptable response time for large databases. Later solutions make use of some preprocessing and o...
متن کاملPrivate Information Storage with Logarithmic-space Secure Hardware
In Private Information Retrieval (PIR), a user obtains one of N records from a server, without the server learning what record was requested. Recent research in “practical PIR” has limited the players to the user and server and limited the user’s work to negotiating a session key (eg. as in SSL)— but then added a secure coprocessor to the server and required the secure coprocessor to encrypt/pe...
متن کاملPrivate Information Storage with Logarithm-Space Secure Hardware
In Private Information Retrieval (PIR), a user obtains one of N records from a server, without the server learning what record was requested. Recent research in “practical PIR” has limited the players to the user and server and limited the user’s work to negotiating a session key (eg. as in SSL)— but then added a secure coprocessor to the server and required the secure coprocessor to encrypt/pe...
متن کاملFairy Dust, Secrets, and the Real World
89 cynicism. Too many of us believe breaking RSA is at least as hard as fac-toring when it's the other way around: breaking RSA is no harder than factoring, (and it might even be easier). Furthermore, when designing security protocols and systems that use these properties, we depend too often on fairy dust: critical properties that we uncritically assume to be unassailable. One of these critica...
متن کاملProcess Isolation for Reconfigurable Hardware
One of the pillars of trust-worthy computing is process isolation, the ability to keep process data private from other processes running on the same device. While embedded operating systems provide isolation for the software part of these processes, there is no commonly accepted isolation mechanism for the hardware resources. As a result, systems may remain vulnerable to hardware-based attacks....
متن کامل